Reasoning About Iteration and Recursion Uniformly Based on Big-Step Semantics

A reliable technique for deductive program verification should be proven sound with respect to the semantics of programming language. For each different language, construction a separate soundness proof is often laborious undertaking. In language-independent verification, common aspects computer programs are addressed enable reasoning all languages. this work, we propose solution about iteration and recursion based on big-step operational any We give inductive proofs relative completeness our technique. illustrate at simplified languages imperative functional paradigms, diverse features. also mechanism formal results in Coq assistant.